Deviation estimates for Eulerian edit numbers of random graphs

Consider the random graph G(n,p) obtained by allowing each edge in complete on n vertices to be present with probability p independent of other edges. In this paper, we study minimum number edit operations needed convert into an Eulerian graph. We obtain deviation estimates for three types numbers based whether perform only additions or deletions a combination both and show that high probability, roughly n4 suffice all cases.